Matchings in Three Catalan Lattices
نویسندگان
چکیده
In this note we consider a series of lattices that are enumerated by the well-known Catalan numbers. For each of these lattices, we exhibit a matching in a constructive way.
منابع مشابه
Matchings Avoiding Partial Patterns
We show that matchings avoiding a certain partial pattern are counted by the 3Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a bijection between matchings avoiding both patterns 12312 and 121323 and Schröder paths without peaks at level one, which are counted by the super-Catalan numbers or...
متن کاملThe number of non-crossing perfect plane matchings is minimized (almost) only by point sets in convex position
It is well-known that the number of non-crossing perfect matchings of 2k points in convex position in the plane is Ck, the kth Catalan number. Garćıa, Noy, and Tejel proved in 2000 that for any set of 2k points in general position, the number of such matchings is at least Ck. We show that the equality holds only for sets of points in convex position, and for one exceptional configuration of 6 p...
متن کاملOn Non P-recursiveness of Numbers of Matchings (linear Chord Diagrams) with Many Crossings
The number conn counts matchings X on f1; 2; : : : ; 2ng, which are partitions into n two-element blocks, such that the crossing graph of X is connected. Similarly, cron counts matchings whose crossing graph has no isolated vertex. (If it has no edge, Catalan numbers arise.) We prove, using a more generally aplicable criterion, that the sequences (conn) and (cron) are not P-recursive. On the ot...
متن کاملNon-p-recursiveness of Numbers of Matchings or Linear Chord Diagrams with Many Crossings
The number conn counts matchings X on {1, 2, . . . , 2n}, which are partitions into n two-element blocks, such that the crossing graph of X is connected. Similarly, cron counts matchings whose crossing graph has no isolated vertex. (If it has no edge, Catalan numbers arise.) We apply generating functions techniques and prove, using a more generally applicable criterion, that the sequences (conn...
متن کاملMedian Stable Matching for College Admissions
We give a simple and concise proof that so-called generalized median stable matchings are well-defined for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings. JEL classification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Math.
دوره 80 شماره
صفحات -
تاریخ انتشار 2003